Towards a redundancy elimination algorithm for underspecified descriptions
نویسندگان
چکیده
Dependency Tree Semantics (DTS) is an underspecified formalism for representing quantifier scope ambiguities in natural language. DTS features a direct interface with a Dependency grammar and an incremental, constraint-based disambiguation mechanism. In this paper, we discuss the meaning of quantifier dependency in DTS by translating its well formed structures into formulae of a Second Order Logic augmented with Mostowskian generalized quantifiers.
منابع مشابه
Towards a redundancy elimination algorithm for underspecified descriptions
This paper proposes an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR), compute an USR which has fewer readings, but still describes at least one representative of each semantic equivalence class of the original readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it ca...
متن کاملAn Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by largescale grammars. We evaluate the algorith...
متن کاملMinimal Recursion Semantics as Dominance Constraints: Graph-Theoretic Foundation and Application to Grammar Engineering
This thesis defines a translation fromMinimal Recursion Semantics into dominance constraints, two relevant and closely related scope underspecification formalisms. Due to fundamental differences in the way the two formalisms interpret underspecified descriptions, the translation is restricted to a large class of underspecified descriptions that share certain structural properties. On the one ha...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملA redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کامل